منابع مشابه
Process semantics of general inhibitor nets
We define a causality semantics of Place/Transition nets with weighted inhibitor arcs (PTI-nets). We extend the standard approach to defining the partial order semantics of Place/Transition nets (PT-nets) based on the process semantics given through net unfolding and occurrence nets. To deal with inhibitor arcs at the level of occurrence nets activator arcs (and extra conditions) are used. The ...
متن کاملInfinite Process Semantics of Inhibitor Nets
This paper is concerned with defining causality semantics for infinite executions of Petri nets with inhibitor arcs. We first show how one can deal with infinite step sequences and the corresponding occurrence nets (processes) and causal structures. We then discuss how to improve the succinctness of both finite and infinite processes generated from step sequences. In the latter case, the propos...
متن کاملComplete Process Semantics for Inhibitor Nets
In this paper we complete the semantical framework proposed in [13] for process and causality semantics of Petri nets by an additional aim and develop process and causality semantics of place/transition Petri nets with weighted inhibitor arcs (pti-nets) satisfying the semantical framework including this aim. The aim was firstly mentioned in [8] and states that causality semantics deduced from p...
متن کاملComplete Process Semantics for Inhibitor Nets – Technical Report
In this paper we complete the semantical framework proposed in [12] for process and causality semantics of Petri nets by an additional aim and develop process and causality semantics of place/transition Petri nets with weighted inhibitor arcs (pti-nets) satisfying the semantical framework including this aim. The aim was firstly mentioned in [8] and states that causality semantics deduced from p...
متن کاملLoose Semantics of Petri Nets
In this paper, we propose a new,loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantics of a place/transition net reflects all its possible refinements and is given as a category of transition systems with alternative sequences of events over the net. The main result states that each plain morphism between two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1153